A Parallel Priority Data Structure with Applications
نویسندگان
چکیده
We present a parallel priority data structure that im proves the running time of certain algorithms for prob lems that lack a fast and work e cient parallel solu tion As a main application we give a parallel imple mentation of Dijkstra s algorithm which runs in O n time while performing O m log n work on a CREW PRAM This is a logarithmic factor improvement for the running time compared with previous approaches The main feature of our data structure is that the op erations needed in each iteration of Dijkstra s algorithm can be supported in O time
منابع مشابه
Non radial model of dynamic DEA with the parallel network structure
In this article, Non radial method of dynamic DEA with the parallel network structure is presented and is used for calculation of relative efficiency measures when inputs and outputs do not change equally. In this model, DMU divisions under evaluation have been put together in parallel. But its dynamic structure is assumed in series. Since in real applications there are undesirable inputs an...
متن کاملParallel heap: A practical priority queue for fine-to-medium-grained applications on small multiprocessors
We present an eficient implementation of the parallel heap data structure on a bus-based Silicon Graphics multiprocessor GTX/dD. Parallel heap is theoretically the first heap-based data structure to have implemented an optimally scalable parallel priority queue on an exclusive-read exclusive-write parallel random access machine. We compared it with Rao-and-Kumar’s concurrent heap and with the c...
متن کاملMSL Based Concurrent and Efficient Priority Queue
Priority queues are fundamental in the design of modern multiprocessor algorithms. Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. This paper proposes an alternative approach: to base the design of concurrent priority queues on the Modified Skip List data structure. To this...
متن کاملThe Contention Avoiding Concurrent Priority Queue
Efficient and scalable concurrent priority queues are crucial for the performance of many multicore applications, e.g. for task scheduling and the parallelization of various algorithms. Linearizable concurrent priority queues with traditional semantics suffer from an inherent sequential bottleneck in the head of the queue. This bottleneck is the motivation for some recently proposed priority qu...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کامل